Adaptive Balancing of a Bank of Sugar - Beet Presses Using a Genetic Algorithm with Variable Local Search Range
نویسنده
چکیده
The paper describes an application of a genetic algorithm with a variable local search operator for load balancing in energy-intensive processing of sugar beet. The variable local search operator enables the genetic algorithm to track optima of the time-varying dynamic systems. It constitutes an adaptive tracking mechanism as it is triggered only when the running average of the best performing members of the population deteriorates. Results obtained on simulation suggest that the genetic algorithm-based optimiser can significantly improve energy efficiency of the real press station. The technique is believed to be a feasible engineering solution to a general load balancing problem between a number of parallel processing units with a measure of performance which reflects only an overall effectiveness of the system controlled and not that of individual processing elements.
منابع مشابه
Load Balancing Application of the Genetic Algorithm in a Nonstationary Environment
There is a wide range of industrial activities involving load balancing problems and there is currently no general approach to such problems. The genetic algorithm, (Holland 1975), has proved to be successful on optimisation problems and is often used in conjunction with other methods. This paper describes and compares two methods which use the genetic algorithm to balance the load of the press...
متن کاملOPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA
In this article, by Partitioning of designing space, optimization speed is tried to be increased by GA. To this end, designing space search is done in two steps which are global search and local search. To achieve this goal, according to meshing in FEM, firstly, the list of sections is divided to specific subsets. Then, intermediate member of each subset, as representative of subset, is defined...
متن کاملA Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect
Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...
متن کاملUse of the Genetic Algorithm for Load Balancing of Sugar Beet Presses
obtaining, from the models, ratios to run the presses at and running the presses at those ratios. Results will be obtained during the next sugar processing campaign. On-line tests of direct optimal control are currently running at the Bardney Sugar Factory and their results will be evaluated at the end of current sugar campaign by calculating the content of dry substances in pressed pulp per un...
متن کاملIIR System Identification Using Improved Harmony Search Algorithm with Chaos
Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...
متن کامل